Constraint and Variable Ordering Heuristics for Compiling Configuration Problems
نویسندگان
چکیده
To facilitate interactive design, the solutions to configuration problems can be compiled into a decision diagram. We develop three heuristics for reducing the time and space required to do this. These heuristics are based on the distinctive clustered and hierarchical structure of the constraint graphs of configuration problems. The first heuristic attempts to limit the growth in the size of the decision diagram by providing an order in which constraints are added to the decision diagram. The second heuristic provides an initial order for the variables within the decision diagram. Finally, the third heuristic groups variables together so that they can be reordered by a dynamic variable reordering procedure used during the construction of the decision diagram. These heuristics provide one to two orders magnitude improvement in the time to compile a wide range of configuration.
منابع مشابه
An Improved Constraint Ordering Heuristics for Compiling Configuration Problems
This paper is a case study on generating BDDs (binary decision diagrams) for propositional encodings of industrial configuration problems. As a testbed we use product configuration formulas arising in the automotive industry. Our main contribution is the introduction of a new improved constraint ordering heuristics incorporating structure-specific knowledge of the problem at hand. With the help...
متن کاملVariable and Value Ordering Heuristics for Hard Constraint Satisfaction Problems: an Application to Job Shop Scheduling
Hard Constraint Satisfaction Problems (HCSPs) are Constraint Satisfaction Problems (CSPs) with very large search spaces and very few solutions. Real-life problems such as design or factory scheduling are examples of HCSPs. These problems typically involve several hundred (or even several thousand) variables, each with up to several hundred possible values, only a very tiny fraction of which ult...
متن کاملEffect of DisCSP Variable-Ordering Heuristics in Scale-Free Networks
A Distributed Constraint Satisfaction Problem (DisCSP) is a constraint satisfaction problem in which variables and constraints are distributed among multiple agents. Various algorithms for solving DisCSPs have been developed, which are intended for general purposes, i.e., they can be applied to any network structure. However, if a network has some particular structure, e.g., the network structu...
متن کاملMulti Level Variable Ordering Heuristics for the Constraint Satisfaction Problem
The usual way for solving constraint satisfaction problems is to use a backtracking algorithm One of the key factors in its e ciency is the rule it will use to decide on which variable to branch next namely the variable ordering heuristics In this paper we attempt to give a general formulation of dynamic variable ordering heuristics that take into account the properties of the neighborhood of t...
متن کاملEfficient Recognition of Acyclic Clustered Constraint Satisfaction Problems
In this paper we present a novel approach to solving Constraint Satisfaction Problems whose constraint graphs are highly clustered and the graph of clusters is close to being acyclic. Such graphs are encountered in many real world application domains such as configuration, diagnosis, model-based reasoning and scheduling. We present a class of variable ordering heuristics that exploit the cluste...
متن کامل